
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
	int i,north = 0,west = 0;
	vector<char> dir; 
	string s;
	while(cin >> s){
		dir.clear();
		if(s == "#")break;
		i = 0;
		int a = 0,a1 = 0,a2 = 1;
		north = 0;
		west = 0;
		while(i < s.length()){
			if (s[i] == 'w'){dir.push_back('w');i+=4;}else 
			if (s[i] == 'n'){dir.push_back('n');i+=5;}
			
		}
		reverse(dir.begin(),dir.end());
		if(dir[0] == 'n'){a1 = 0;north++;}
		if(dir[0] == 'w'){a1 = 90;west++;}
        
		for(i=1;i<dir.size();i++){
			
			if(dir[i] == 'n'){
				
				a1 = abs((a1*pow(2.0,i) - 90 * a2));
				a2 *= pow(2.0,i);
				
			}
			else {
			
				a1 = abs((a1*pow(2.0,i) + 90 * a2));
					a2 *= pow(2.0,i);
				
			}
	}
			
			int d = __gcd(a1,a2);
			a1/=d;
			a2/=d;
			if(a2==1)cout<<a1 << endl;
			else 
			cout << a1 <<"/" <<a2 << endl;
		
		
		//cout<<a1<<"/"<<a2<<endl;
	}
	
	
	
	return 0;
}